Streaming Algorithms for 2-Coloring Uniform Hypergraphs
نویسندگان
چکیده
We consider the problem of two-coloring n-uniform hypergraphs. It is known that any such hypergraph with at most 1 10 √
منابع مشابه
Hypergraph Two-Coloring in the Streaming Model
We consider space-efficient algorithms for two-coloring n-uniform hypergraphs H = (V,E) in the streaming model, when the hyperedges arrive one at a time. It is known that any such hypergraph with at most 0.7 √ n lnn 2 hyperedges has a two-coloring [4], which can be found deterministically in polynomial time, if allowed full access to the input. • Let s(v, q, n) be the minimum space used by a de...
متن کاملApproximate coloring of uniform hypergraphs
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of finding the exact value of the chromatic number of a hypergraph is known to be NP-hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-un...
متن کاملMultipass greedy coloring of simple uniform hypergraphs
Let m∗(n) be the minimum number of edges in an n-uniform simple hypergraph that is not two colorable. We prove that m∗(n) = Ω(4n/ ln(n)). Our result generalizes to r-coloring of b-simple uniform hypergraphs. For fixed r and b we prove that a maximum vertex degree in b-simple n-uniform hypergraph that is not r-colorable must be Ω(rn/ ln(n)). By trimming arguments it implies that every such graph...
متن کاملColoring uniform hypergraphs with few edges
A hypergraph is b-simple if no two distinct edges share more than b vertices. Let m(r, t, g) denote the minimum number of edges in an r-uniform non-t-colorable hypergraph of girth at least g. Erdős and Lovász proved that m(r, t, 3) ≥ t 2(r−2) 16r(r − 1)2 and m(r, t, g) ≤ 4 · 20g−1r3g−5t(g−1)(r+1). A result of Szabó improves the lower bound by a factor of r2− for sufficiently large r. We improve...
متن کاملThe 1-2-3 Conjecture for Uniform Hypergraphs
Given an r-uniform hypergraph H = (V,E) and a weight function ω : E → {1, . . . , w}, a coloring of vertices of H, induced by ω, is defined by c(v) = ∑ e3v w(e) for all v ∈ V . In this paper, we show that for almost all 3-uniform hypergraphs there exists a weighting of the edges from {1, 2} that induces a proper vertex-coloring (that means with no monochromatic edges). For r ≥ 4, we show that a...
متن کامل